The termination criterion for subdivision of the rational Bézier curves
نویسندگان
چکیده
By using some elementary inequalities, authors in this paper makes further improvement for estimating the heights of Bézier curve and rational Bézier curve. And the termination criterion for subdivision of the rational Bézier curve is also improved. The conclusion of the extreme value problem is thus further confirmed.
منابع مشابه
An Optimal G^2-Hermite Interpolation by Rational Cubic Bézier Curves
In this paper, we study a geometric G^2 Hermite interpolation by planar rational cubic Bézier curves. Two data points, two tangent vectors and two signed curvatures interpolated per each rational segment. We give the necessary and the sufficient intrinsic geometric conditions for two C^2 parametric curves to be connected with G2 continuity. Locally, the free parameters w...
متن کاملRapid Termination Evaluation for Recursive Subdivision of Bezier Curves
Bézier curve flattening by recursive subdivision requires that the maximum excursion of the subdivided curve segment be known so that recursion can be terminated once this value drops below the specified flatness criterion. A much more accurate method than the most commonly used techniques to evaluate this distance is presented. This method stops recursion sooner, significantly reducing the num...
متن کاملSubdivision termination criteria in subdivision multivariate solvers using dual hyperplanes representations
The need for robust solutions for sets of non-linear multivariate constraints or equations needs no motivation. Subdivision-based multivariate constraint solvers [1–3] typically employ the convex hull and subdivision/domain clipping properties of the Bézier/B-spline representation to detect all regions that may contain a feasible solution. Once such a region has been identified, a numerical imp...
متن کاملSubdivision Termination Criteria in Subdivision Multivariate Solvers
The need for robust solutions for sets of non-linear multivariate constraints or equations needs no motivation. Subdivision-based multivariate constraint solvers [1–3] typically employ the convex hull and subdivision/domain clipping properties of the Bézier/B-spline representation to detect all regions that may contain a feasible solution. Once such a region has been identified, a numerical imp...
متن کاملFast, precise flattening of cubic Bézier path and offset curves
We present two related algorithms for flattening (generating polyline approximations for) curves associated with planar cubic Bézier segments. One flattens the path curve, and the other flattens the left and right offset curves. The algorithm for flattening path curves yields an average of 67% of the vertices generated by recursive subdivision, while maintaining flatness to within 4% of the spe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Zhejiang University. Science
دوره 4 1 شماره
صفحات -
تاریخ انتشار 1991